________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        05.02.2010 04:09:47
Input Data from:  dataset244.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :40
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,166333333333333
Average f[i]   :4900
Average g[i,j] :2027,92792792793
Total demand   :17020
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 38
> Selected Move:	4360	1	-1	28	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 4360


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 181
> Selected Move:	5280	1	-1	3	10500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 5280


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 183
> Selected Move:	6600	1	-1	4	16500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 6600


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 246
> Selected Move:	7560	1	-1	7	22000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 7560


> New S[]: 
	
	 0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 167
> Selected Move:	8240	3	1	8	23900


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 8240


> New S[]: 
	
	 0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 248
> Selected Move:	8560	3	28	21	25400


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 133
> Selected Move:	8850	3	4	29	24900


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 8850


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 144
> Selected Move:	8850	4	8	3	23500


> New Y[]: 
	
	 2  0  4  3  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 158
> Selected Move:	8870	3	3	20	23800


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 8870


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 214
> Selected Move:	9330	3	7	17	22300


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 9330


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 255
> Selected Move:	9506	1	-1	30	26800


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 209
> Selected Move:	10228	3	29	38	25300


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 215
> Selected Move:	10370	4	20	21	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0    >new incumb.: 10370


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 248
> Selected Move:	10370	3	8	22	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  3  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 171
> Selected Move:	10470	3	21	37	24600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  3  1  0    >new incumb.: 10470


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 185
> Selected Move:	10660	3	20	29	23600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  3  1  0    >new incumb.: 10660


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 252
> Selected Move:	10780	3	22	35	24100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  3  1  0    >new incumb.: 10780


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 181
> Selected Move:	10880	3	37	19	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  1  0    >new incumb.: 10880


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 132
> Selected Move:	10880	4	19	29	23700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 147
> Selected Move:	10880	4	29	35	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 127
> Selected Move:	10764	3	30	12	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 118
> Selected Move:	10850	4	35	12	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 146
> Selected Move:	10850	4	12	19	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 148
> Selected Move:	10880	3	12	39	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 85
> Selected Move:	10880	4	19	29	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 112
> Selected Move:	10850	3	39	12	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 193
> Selected Move:	10670	3	38	8	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 266
> Selected Move:	10790	3	12	30	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 221
> Selected Move:	10790	4	29	19	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 221
> Selected Move:	10780	3	19	37	24600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 226
> Selected Move:	10780	3	8	23	24100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 217
> Selected Move:	10760	3	37	19	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 190
> Selected Move:	10760	4	19	29	23700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  3  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 200
> Selected Move:	10760	4	29	35	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 181
> Selected Move:	10718	3	23	8	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 212
> Selected Move:	10648	4	35	8	25400


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 206
> Selected Move:	10690	3	8	23	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  3  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 184
> Selected Move:	10622	4	23	30	25400


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  1  3  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 169
> Selected Move:	10744	3	23	38	25400


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  3  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 39 #######################


> Neighbours evaluated; 117
> Selected Move:	10777	3	30	39	25300


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 40 #######################


> Neighbours evaluated; 109
> Selected Move:	10660	3	35	22	24800


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 41 #######################


> Neighbours evaluated; 202
> Selected Move:	10660	4	39	19	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 42 #######################


> Neighbours evaluated; 204
> Selected Move:	10660	4	19	29	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 43 #######################


> Neighbours evaluated; 223
> Selected Move:	10660	3	39	30	23200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 44 #######################


> Neighbours evaluated; 226
> Selected Move:	10660	4	29	19	23500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 45 #######################


> Neighbours evaluated; 220
> Selected Move:	10660	4	19	30	24900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 46 #######################


> Neighbours evaluated; 202
> Selected Move:	10610	3	30	13	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 47 #######################


> Neighbours evaluated; 150
> Selected Move:	10610	4	13	19	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  3  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 48 #######################


> Neighbours evaluated; 161
> Selected Move:	10620	3	19	5	25000


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 49 #######################


> Neighbours evaluated; 173
> Selected Move:	10620	4	5	29	24200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 50 #######################


> Neighbours evaluated; 194
> Selected Move:	10740	3	29	15	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 51 #######################


> Neighbours evaluated; 215
> Selected Move:	10740	3	13	12	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  1  0  0  3  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 52 #######################


> Neighbours evaluated; 236
> Selected Move:	10740	3	12	30	24200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 53 #######################


> Neighbours evaluated; 164
> Selected Move:	10740	3	22	35	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 
 > pw :0,33

## ITERATION 54 #######################


> Neighbours evaluated; 137
> Selected Move:	10740	3	38	23	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 55 #######################


> Neighbours evaluated; 165
> Selected Move:	10740	3	35	22	24200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 56 #######################


> Neighbours evaluated; 173
> Selected Move:	10740	3	30	13	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 57 #######################


> Neighbours evaluated; 232
> Selected Move:	10677	3	13	39	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 58 #######################


> Neighbours evaluated; 163
> Selected Move:	10678	3	23	38	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,305

## ITERATION 59 #######################


> Neighbours evaluated; 165
> Selected Move:	10650	3	5	19	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,3

## ITERATION 60 #######################


> Neighbours evaluated; 164
> Selected Move:	10650	3	38	23	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 61 #######################


> Neighbours evaluated; 167
> Selected Move:	10650	3	39	12	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  3  0  1  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 62 #######################


> Neighbours evaluated; 255
> Selected Move:	10650	4	15	19	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 63 #######################


> Neighbours evaluated; 236
> Selected Move:	10650	3	12	30	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  3  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 64 #######################


> Neighbours evaluated; 153
> Selected Move:	10650	4	19	15	23700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 65 #######################


> Neighbours evaluated; 161
> Selected Move:	10738	3	0	33	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 66 #######################


> Neighbours evaluated; 251
> Selected Move:	10829	3	23	38	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 67 #######################


> Neighbours evaluated; 244
> Selected Move:	10751	3	33	3	25600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 68 #######################


> Neighbours evaluated; 173
> Selected Move:	10874	3	19	28	25100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 69 #######################


> Neighbours evaluated; 192
> Selected Move:	10824	4	3	15	25300


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 70 #######################


> Neighbours evaluated; 204
> Selected Move:	10742	3	38	23	25300


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  1  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 71 #######################


> Neighbours evaluated; 206
> Selected Move:	10794	4	3	15	25100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 72 #######################


> Neighbours evaluated; 224
> Selected Move:	10688	3	22	35	25600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 73 #######################


> Neighbours evaluated; 188
> Selected Move:	10783	3	15	29	25100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  3  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 74 #######################


> Neighbours evaluated; 209
> Selected Move:	10812	3	23	38	25100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 75 #######################


> Neighbours evaluated; 167
> Selected Move:	10730	3	3	33	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  1  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,29

## ITERATION 76 #######################


> Neighbours evaluated; 163
> Selected Move:	10730	3	38	23	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  3  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 77 #######################


> Neighbours evaluated; 204
> Selected Move:	10642	4	33	35	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  3  1  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,3

## ITERATION 78 #######################


> Neighbours evaluated; 197
> Selected Move:	10640	3	23	38	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  1  0  0  1  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,305

## ITERATION 79 #######################


> Neighbours evaluated; 151
> Selected Move:	10680	3	29	10	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 80 #######################


> Neighbours evaluated; 147
> Selected Move:	10710	4	35	33	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 81 #######################


> Neighbours evaluated; 170
> Selected Move:	10679	3	30	12	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 82 #######################


> Neighbours evaluated; 152
> Selected Move:	10710	4	33	12	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  2  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 83 #######################


> Neighbours evaluated; 157
> Selected Move:	10695	3	10	29	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,33

## ITERATION 84 #######################


> Neighbours evaluated; 150
> Selected Move:	10661	4	12	33	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,335

## ITERATION 85 #######################


> Neighbours evaluated; 154
> Selected Move:	10639	3	33	3	25600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 86 #######################


> Neighbours evaluated; 160
> Selected Move:	10496	3	12	13	25600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 87 #######################


> Neighbours evaluated; 139
> Selected Move:	10696	3	35	22	25100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 88 #######################


> Neighbours evaluated; 218
> Selected Move:	10730	3	29	10	24900


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 89 #######################


> Neighbours evaluated; 248
> Selected Move:	10700	3	38	23	24900


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 90 #######################


> Neighbours evaluated; 242
> Selected Move:	10694	3	10	29	25100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 91 #######################


> Neighbours evaluated; 248
> Selected Move:	10481	3	22	35	25600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  3  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 92 #######################


> Neighbours evaluated; 222
> Selected Move:	10492	3	29	10	25400


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 93 #######################


> Neighbours evaluated; 240
> Selected Move:	10640	3	13	30	24900


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 94 #######################


> Neighbours evaluated; 190
> Selected Move:	10630	3	3	33	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 95 #######################


> Neighbours evaluated; 179
> Selected Move:	10622	3	23	8	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  1  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 96 #######################


> Neighbours evaluated; 194
> Selected Move:	10613	3	10	29	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 97 #######################


> Neighbours evaluated; 212
> Selected Move:	10603	3	33	3	25600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 98 #######################


> Neighbours evaluated; 214
> Selected Move:	10510	3	29	10	25400


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  1  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 99 #######################


> Neighbours evaluated; 209
> Selected Move:	10610	3	8	38	24900


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 100 #######################


> Neighbours evaluated; 173
> Selected Move:	10604	3	10	15	25600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 101 #######################


> Neighbours evaluated; 106
> Selected Move:	10518	4	3	15	25800


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 102 #######################


> Neighbours evaluated; 129
> Selected Move:	10514	3	38	23	25800


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 103 #######################


> Neighbours evaluated; 185
> Selected Move:	10385	3	15	29	26000


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  2  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 104 #######################


> Neighbours evaluated; 178
> Selected Move:	10410	3	23	38	26000


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  2  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 105 #######################


> Neighbours evaluated; 125
> Selected Move:	10443	3	35	22	25500


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  2  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 106 #######################


> Neighbours evaluated; 169
> Selected Move:	10680	3	29	16	25000


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 107 #######################


> Neighbours evaluated; 117
> Selected Move:	10680	4	3	16	25000


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 108 #######################


> Neighbours evaluated; 139
> Selected Move:	10660	3	16	29	24600


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 109 #######################


> Neighbours evaluated; 205
> Selected Move:	10660	3	3	33	24300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  3  1  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 110 #######################


> Neighbours evaluated; 260
> Selected Move:	10640	3	29	15	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 111 #######################


> Neighbours evaluated; 212
> Selected Move:	10640	3	38	23	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  1  0  0  0  0  1  0  1  0  0  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 112 #######################


> Neighbours evaluated; 181
> Selected Move:	10504	3	33	5	25600


> New Y[]: 
	
	 0  0  4  0  0  2  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 113 #######################


> Neighbours evaluated; 194
> Selected Move:	10597	3	23	38	25600


> New Y[]: 
	
	 0  0  4  0  0  2  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 114 #######################


> Neighbours evaluated; 187
> Selected Move:	10575	3	15	29	25100


> New Y[]: 
	
	 0  0  4  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 115 #######################


> Neighbours evaluated; 240
> Selected Move:	10420	3	29	10	24900


> New Y[]: 
	
	 0  0  4  0  0  2  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 116 #######################


> Neighbours evaluated; 223
> Selected Move:	10530	3	5	3	24400


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 117 #######################


> Neighbours evaluated; 220
> Selected Move:	10530	3	3	33	24100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 118 #######################


> Neighbours evaluated; 251
> Selected Move:	10530	4	33	22	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  2  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 119 #######################


> Neighbours evaluated; 234
> Selected Move:	10575	3	10	29	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  0  0  0  0  1  3  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 120 #######################


> Neighbours evaluated; 258
> Selected Move:	10492	4	22	28	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  2  3  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 121 #######################


> Neighbours evaluated; 259
> Selected Move:	10445	3	29	10	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  2  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 122 #######################


> Neighbours evaluated; 244
> Selected Move:	10409	3	22	35	25700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 123 #######################


> Neighbours evaluated; 132
> Selected Move:	10362	3	28	21	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  2  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 124 #######################


> Neighbours evaluated; 117
> Selected Move:	10402	4	10	21	25700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 125 #######################


> Neighbours evaluated; 115
> Selected Move:	10443	4	10	33	25600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 126 #######################


> Neighbours evaluated; 110
> Selected Move:	10530	3	10	29	25600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  1  1  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,455

## ITERATION 127 #######################


> Neighbours evaluated; 116
> Selected Move:	10535	3	35	22	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  1  0  0  0  0  0  0  1  1  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 128 #######################


> Neighbours evaluated; 256
> Selected Move:	10568	3	21	37	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  2  0  0  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,465

## ITERATION 129 #######################


> Neighbours evaluated; 208
> Selected Move:	10454	3	22	35	25700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  2  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 130 #######################


> Neighbours evaluated; 147
> Selected Move:	10390	3	29	11	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 131 #######################


> Neighbours evaluated; 108
> Selected Move:	10360	3	35	22	24200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  0  0  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 132 #######################


> Neighbours evaluated; 180
> Selected Move:	10424	3	11	10	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  0  0  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 133 #######################


> Neighbours evaluated; 199
> Selected Move:	10530	3	33	0	23600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 134 #######################


> Neighbours evaluated; 242
> Selected Move:	10780	3	22	35	24100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,495

## ITERATION 135 #######################


> Neighbours evaluated; 171
> Selected Move:	10780	4	37	10	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 136 #######################


> Neighbours evaluated; 156
> Selected Move:	10680	3	10	29	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,505

## ITERATION 137 #######################


> Neighbours evaluated; 161
> Selected Move:	10679	3	38	23	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  3  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,51

## ITERATION 138 #######################


> Neighbours evaluated; 181
> Selected Move:	10660	3	29	10	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 139 #######################


> Neighbours evaluated; 151
> Selected Move:	10660	4	10	37	24100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 140 #######################


> Neighbours evaluated; 214
> Selected Move:	10690	3	23	8	24600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 141 #######################


> Neighbours evaluated; 230
> Selected Move:	10560	3	37	19	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 142 #######################


> Neighbours evaluated; 232
> Selected Move:	10650	3	8	38	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 143 #######################


> Neighbours evaluated; 167
> Selected Move:	10650	4	19	10	23500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 144 #######################


> Neighbours evaluated; 195
> Selected Move:	10650	4	10	35	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 145 #######################


> Neighbours evaluated; 162
> Selected Move:	10555	3	30	12	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 146 #######################


> Neighbours evaluated; 198
> Selected Move:	10650	4	35	10	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 147 #######################


> Neighbours evaluated; 256
> Selected Move:	10650	4	10	12	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  3  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 148 #######################


> Neighbours evaluated; 231
> Selected Move:	10650	4	12	19	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 149 #######################


> Neighbours evaluated; 235
> Selected Move:	10720	3	19	37	24600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,45

## ITERATION 150 #######################


> Neighbours evaluated; 187
> Selected Move:	10850	3	10	29	24600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,445

## ITERATION 151 #######################


> Neighbours evaluated; 179
> Selected Move:	10736	3	12	39	25100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,44

## ITERATION 152 #######################


> Neighbours evaluated; 149
> Selected Move:	10736	3	29	10	25100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,435

## ITERATION 153 #######################


> Neighbours evaluated; 162
> Selected Move:	10650	3	37	19	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 154 #######################


> Neighbours evaluated; 120
> Selected Move:	10650	4	19	10	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 155 #######################


> Neighbours evaluated; 161
> Selected Move:	10610	3	39	13	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,42

## ITERATION 156 #######################


> Neighbours evaluated; 214
> Selected Move:	10610	4	10	19	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,415

## ITERATION 157 #######################


> Neighbours evaluated; 209
> Selected Move:	10610	3	10	29	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,41

## ITERATION 158 #######################


> Neighbours evaluated; 114
> Selected Move:	10610	4	19	29	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 
 > pw :0,405

## ITERATION 159 #######################


> Neighbours evaluated; 130
> Selected Move:	10610	3	29	15	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,4

## ITERATION 160 #######################


> Neighbours evaluated; 156
> Selected Move:	10660	3	19	5	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,395

## ITERATION 161 #######################


> Neighbours evaluated; 200
> Selected Move:	10661	3	13	12	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  1  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,39

## ITERATION 162 #######################


> Neighbours evaluated; 224
> Selected Move:	10662	3	38	23	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  1  0  0  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 163 #######################


> Neighbours evaluated; 222
> Selected Move:	10663	3	12	13	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 164 #######################


> Neighbours evaluated; 201
> Selected Move:	10610	3	5	19	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 165 #######################


> Neighbours evaluated; 160
> Selected Move:	10650	3	13	12	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  3  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 166 #######################


> Neighbours evaluated; 237
> Selected Move:	10650	3	12	30	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 167 #######################


> Neighbours evaluated; 153
> Selected Move:	10658	3	0	33	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 168 #######################


> Neighbours evaluated; 211
> Selected Move:	10654	3	23	38	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 
 > pw :0,375

## ITERATION 169 #######################


> Neighbours evaluated; 157
> Selected Move:	10650	3	33	0	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 
 > pw :0,38

## ITERATION 170 #######################


> Neighbours evaluated; 120
> Selected Move:	10650	4	15	19	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 
 > pw :0,385

## ITERATION 171 #######################


> Neighbours evaluated; 123
> Selected Move:	10650	3	35	22	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  3  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 172 #######################


> Neighbours evaluated; 148
> Selected Move:	10650	4	19	15	23700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 173 #######################


> Neighbours evaluated; 181
> Selected Move:	10650	3	30	12	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 174 #######################


> Neighbours evaluated; 240
> Selected Move:	10650	4	15	19	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 175 #######################


> Neighbours evaluated; 218
> Selected Move:	10610	3	12	13	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 176 #######################


> Neighbours evaluated; 142
> Selected Move:	10610	4	19	15	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 177 #######################


> Neighbours evaluated; 200
> Selected Move:	10626	3	0	33	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 178 #######################


> Neighbours evaluated; 194
> Selected Move:	10630	3	38	23	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 179 #######################


> Neighbours evaluated; 199
> Selected Move:	10681	3	33	3	26100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 180 #######################


> Neighbours evaluated; 183
> Selected Move:	10626	3	23	38	26100


> New Y[]: 
	
	 0  0  4  2  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 181 #######################


> Neighbours evaluated; 200
> Selected Move:	10565	4	3	15	26300


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 182 #######################


> Neighbours evaluated; 184
> Selected Move:	10638	3	13	30	25800


> New Y[]: 
	
	 0  0  4  3  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 183 #######################


> Neighbours evaluated; 169
> Selected Move:	10600	3	3	33	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  3  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 184 #######################


> Neighbours evaluated; 216
> Selected Move:	10805	4	33	19	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  3  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 185 #######################


> Neighbours evaluated; 240
> Selected Move:	10768	3	19	37	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 186 #######################


> Neighbours evaluated; 189
> Selected Move:	10736	3	22	35	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 
 > pw :0,365

## ITERATION 187 #######################


> Neighbours evaluated; 118
> Selected Move:	10732	3	38	23	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 188 #######################


> Neighbours evaluated; 135
> Selected Move:	10672	3	35	22	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 189 #######################


> Neighbours evaluated; 161
> Selected Move:	10708	3	37	19	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  3  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 190 #######################


> Neighbours evaluated; 252
> Selected Move:	10646	3	22	35	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  3  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 191 #######################


> Neighbours evaluated; 212
> Selected Move:	10642	3	23	38	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0 
 > pw :0,39

## ITERATION 192 #######################


> Neighbours evaluated; 165
> Selected Move:	10443	3	30	12	26300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,395

## ITERATION 193 #######################


> Neighbours evaluated; 165
> Selected Move:	10507	3	19	37	26400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,4

## ITERATION 194 #######################


> Neighbours evaluated; 115
> Selected Move:	10460	3	38	23	26400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 195 #######################


> Neighbours evaluated; 129
> Selected Move:	10424	3	37	19	26300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 196 #######################


> Neighbours evaluated; 204
> Selected Move:	10377	3	12	13	26300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 197 #######################


> Neighbours evaluated; 179
> Selected Move:	10578	3	35	22	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 198 #######################


> Neighbours evaluated; 185
> Selected Move:	10574	3	23	38	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 199 #######################


> Neighbours evaluated; 182
> Selected Move:	10418	3	19	37	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 200 #######################


> Neighbours evaluated; 192
> Selected Move:	10413	3	38	23	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 201 #######################


> Neighbours evaluated; 209
> Selected Move:	10259	3	13	12	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,44

## ITERATION 202 #######################


> Neighbours evaluated; 188
> Selected Move:	10344	3	23	38	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,445

## ITERATION 203 #######################


> Neighbours evaluated; 175
> Selected Move:	10384	3	37	19	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 204 #######################


> Neighbours evaluated; 216
> Selected Move:	10325	3	12	39	26300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 205 #######################


> Neighbours evaluated; 212
> Selected Move:	10273	3	19	37	26400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,46

## ITERATION 206 #######################


> Neighbours evaluated; 160
> Selected Move:	10186	3	22	35	26900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1 
 > pw :0,465

## ITERATION 207 #######################


> Neighbours evaluated; 96
> Selected Move:	10177	3	38	23	26900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,47

## ITERATION 208 #######################


> Neighbours evaluated; 140
> Selected Move:	10162	3	35	22	26400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,475

## ITERATION 209 #######################


> Neighbours evaluated; 148
> Selected Move:	10202	3	37	19	26300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 210 #######################


> Neighbours evaluated; 227
> Selected Move:	10266	3	39	12	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 211 #######################


> Neighbours evaluated; 206
> Selected Move:	10262	3	19	21	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  3  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 212 #######################


> Neighbours evaluated; 138
> Selected Move:	10413	3	12	30	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  3  1  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 213 #######################


> Neighbours evaluated; 235
> Selected Move:	10412	3	23	38	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  3  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 214 #######################


> Neighbours evaluated; 209
> Selected Move:	10500	3	15	16	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  3  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,505

## ITERATION 215 #######################


> Neighbours evaluated; 204
> Selected Move:	10450	4	16	33	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  3  1  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 216 #######################


> Neighbours evaluated; 213
> Selected Move:	10380	3	16	32	24100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  1  0  0  0  0  0  0  0  1  0  1  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 217 #######################


> Neighbours evaluated; 255
> Selected Move:	10520	3	30	12	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  3  1  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52
________________________________________________________________

Best solution found: 10880
Run Termination time: 05.02.2010 05:03:30
Run duration: 00:53:42.3125000
________________________________________________________________
